منابع مشابه
Monoid-matrix type automata
Article history: Received 3 February 2013 Accepted 7 August 2013 Communicated by M. Ito
متن کاملWalking automata in the free inverse monoid
In this paper, we study languages of birooted trees or, following Scheiblich-Munn’s theorem, subsets of free inverse monoids. Extending the classical notion of rational languages with a projection operator that maps every set of birooted trees to the subset of its idempotent elements it is first shown that the hierarchy induced by the nesting depth of that projection operator simply correspond ...
متن کاملMonoid Automata for Displacement Context-Free Languages
In 2007 Kambites presented an algebraic interpretation of Chomsky-Schützenberger theorem for context-free languages. We give an interpretation of the corresponding theorem for the class of displacement context-free languages which are equivalent to well-nested multiple context-free languages. We also obtain a characterization of kdisplacement context-free languages in terms of monoid automata a...
متن کاملProfinite techniques for probabilistic automata and the Markov Monoid algorithm
We consider the value 1 problem for probabilistic automata over finite words. This problem is known to be undecidable. However, different algorithms have been proposed to partially solve it. The aim of this paper is to prove that one such algorithm, called the Markov Monoid algorithm, is optimal. To this end, we develop a profinite theory for probabilistic automata. This new framework gives a t...
متن کاملWord problems recognisable by deterministic blind monoid automata
We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class including groups, such an automaton accepts the word problem of a group H if and only if H has a finite index subgroup which embeds in M . In the case that M is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.08.006